Completeness and super-valuationsHARDEGREE, Gary M.Journal of philosophical logic. 2005, Vol 34, Num 1, pp 81-95, issn 0022-3611, 15 p.Article

Market completeness: How options affect hedging and investments in the electricity sectorWILLEMS, Bert; MORBEE, Joris.Energy economics. 2010, Vol 32, Num 4, pp 786-795, issn 0140-9883, 10 p.Article

The restrictive H-coloring problemDIAZ, Josep; SERNA, Maria; THILIKOS, Dimitrios M et al.Discrete applied mathematics. 2005, Vol 145, Num 2, pp 297-305, issn 0166-218X, 9 p.Article

Bi-immunity separates strong NP-completeness notionsPAVAN, A; SELMAN, Alan L.Information and computation (Print). 2004, Vol 188, Num 1, pp 116-126, issn 0890-5401, 11 p.Article

An assertion concerning functionally complete algebras and NP-completenessHORVATH, Gabor; NEHANIV, Chrystopher L; SZABO, Csaba et al.Theoretical computer science. 2008, Vol 407, Num 1-3, pp 591-595, issn 0304-3975, 5 p.Article

An extension of Ekeland's variational principle to locally complete spacesBOSCHA, C; GARCIA, A; GARCIA, C. L et al.Journal of mathematical analysis and applications. 2007, Vol 328, Num 1, pp 106-108, issn 0022-247X, 3 p.Article

Validity, the Squeezing Argument and Alternative Semantic Systems: the Case of Aristotelian SyllogisticANDRADE-LOTERO, Edgar; DUTILH NOVAES, Catarina.Journal of philosophical logic. 2012, Vol 41, Num 2, pp 387-418, issn 0022-3611, 32 p.Article

Flexible consistency modes for active databases applicationsETZION, O.Information systems (Oxford). 1993, Vol 18, Num 6, pp 391-404, issn 0306-4379Article

The importance of physicalism in the philosophy of religionANGEL, Leonard.International journal for philosophy of religion. 2010, Vol 67, Num 3, pp 141-156, issn 0020-7047, 16 p.Article

Finite models constructed from canonical formulasMOSS, Lawrence S.Journal of philosophical logic. 2007, Vol 36, Num 6, pp 605-640, issn 0022-3611, 36 p.Article

Weak completeness in E and E₂JUEDES, D. W; LUTZ, J. H.Theoretical computer science. 1995, Vol 143, Num 1, pp 149-158, issn 0304-3975Article

The accuracy of medical history information in referral lettersDEANGELIS, A. F; CHAMBERS, I. G; HALL, G. M et al.Australian dental journal. 2010, Vol 55, Num 2, pp 188-192, issn 0045-0421, 5 p.Article

Modal logic for other-world agnostics: Neutrality and Halldén incompletenessHUMBERSTONE, Lloyd.Journal of philosophical logic. 2007, Vol 36, Num 1, pp 1-32, issn 0022-3611, 32 p.Article

A comparison of electronic and handwritten anaesthetic records for completeness of informationWRIGHTSON, W. A. G.Anaesthesia and intensive care. 2010, Vol 38, Num 6, pp 1052-1058, issn 0310-057X, 7 p.Article

Scattering theory for 3-particle systems in constant magnetic fields : Dispersive caseGERARD, C; ŁABA, I.Annales de l'Institut Fourier. 1996, Vol 46, Num 3, issn 0373-0956, VI, X, 801-876 [78 p.]Article

THE PSPACE-COMPLETENESS OF BLACK-WHITE PEBBLING : Foundations of Computer ScienceHERTEL, Philipp; PITASSI, Toniann.SIAM journal on computing (Print). 2010, Vol 39, Num 6, pp 2622-2682, issn 0097-5397, 61 p.Article

Complete and directed complete Ω-categoriesHONGLIANG LAI; DEXUE ZHANG.Theoretical computer science. 2007, Vol 388, Num 1-3, pp 1-25, issn 0304-3975, 25 p.Article

The role of standardising apart in logic programmingSHEPHERDSON, J. C.Theoretical computer science. 1994, Vol 129, Num 1, pp 143-166, issn 0304-3975Article

Optimal path cover problem on block graphs and bipartite permutation graphsSRIKANT, R; RAVI SUNDARAM; KARAN SHER SINGH et al.Theoretical computer science. 1993, Vol 115, Num 2, pp 351-357, issn 0304-3975Article

A Note on HarmonyFRANCEZ, Nissim; DYCKHOFF, Roy.Journal of philosophical logic. 2012, Vol 41, Num 3, pp 613-628, issn 0022-3611, 16 p.Article

NP-completeness of k-connected hyperedge-replacement languages of order kDREWES, F.Information processing letters. 1993, Vol 45, Num 2, pp 89-94, issn 0020-0190Article

CHARACTERIZING POMONOIDS S BY COMPLETE S-POSETSEBRAHIMI, M. M; MAHMOUDI, M; RASOULI, H et al.Cahiers de topologie et géométrie différentielle catégoriques. 2010, Vol 51, Num 4, pp 272-281, issn 1245-530X, 10 p.Article

Graph splicing systemsSANTHANAM, Rahul; KRITHIVASAN, Kamala.Discrete applied mathematics. 2006, Vol 154, Num 8, pp 1264-1278, issn 0166-218X, 15 p.Article

On finding short resolution refutations and small unsatisfiable subsetsFELLOWS, Michael R; SZEIDER, Stefan; WRIGHTSON, Graham et al.Theoretical computer science. 2006, Vol 351, Num 3, pp 351-359, issn 0304-3975, 9 p.Conference Paper

LACK OF STRONG COMPLETENESS FOR STOCHASTIC FLOWSLI, Xue-Mei; SCHEUTZOW, Michael.Annals of probability. 2011, Vol 39, Num 4, pp 1407-1421, issn 0091-1798, 15 p.Article